About permutation algebras, (pre)sheaves and named sets
نویسندگان
چکیده
منابع مشابه
About permutation algebras and sheaves ( and named sets , too ! ) ∗
In recent years, many general presentations (metamodels) for calculi dealing with names, e.g. process calculi with name-passing, have been proposed. (Pre)sheaf categories have been proved to satisfy classical properties on the existence of initial algebras/final coalgebras. Named sets are a theory of sets with permutations, introduced as the basis for the operational model of HD-automata. Permu...
متن کاملAbout permutation algebras, (pre)sheaves and named sets
In this paper, we survey some well-known approaches proposed as general models for calculi dealing with names (like e.g. process calculi with namepassing). We focus on (pre)sheaf categories, nominal sets, permutation algebras and named sets. We study the relationships among these models, which allow for transferring techniques and constructions from one model to the other.
متن کاملEffect Algebras, Presheaves, Non-locality and Contextuality
Non-locality and contextuality are among the most counterintuitive aspects of quantum theory. They are difficult to study using classical logic and probability theory. In this paper we start with an effect algebraic approach to the study of non-locality and contextuality. We will see how different slices over the category of set valued functors on the natural numbers induce different settings i...
متن کاملPermutation Group Algebras
We consider the permutation group algebra defined by Cameron and show that if the permutation group has no finite orbits, then no homogeneous element of degree one is a zero-divisor of the algebra. We proceed to make a conjecture which would show that the algebra is an integral domain if, in addition, the group is oligomorphic. We go on to show that this conjecture is true in certain special ca...
متن کاملOn permutation sum sets
A permutation sum (resp. difference) set on a group G is a set F of bijections from G to G such that fg (resp. f−1g) is again a bijection for all f, g ∈ F (resp. f, g ∈ F with f 6= g ∈ S), where (fg)(x) := f(x)g(x) for all x ∈ G, etc. The maximum size d(G) of a permutation difference set has been well studied, with many connections drawn between such sets and combinatorial objects such as famil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Higher-Order and Symbolic Computation
سال: 2006
ISSN: 1388-3690,1573-0557
DOI: 10.1007/s10990-006-8749-3